Using CP and ILP with tree decomposition to solve the sum colouring problem
نویسندگان
چکیده
The Minimum Sum Colouring Problem is an NP-hard problem derived from the well-known graph colouring problem. It consists in finding a proper colouring which minimizes the sum of the assigned colours rather than the number of those colours. This problem often arises in scheduling and resource allocation. Mainly incomplete approaches were proposed, but Integer Linear Programming (ILP) and Constraint Programming (CP) have also been used. In this paper, we conduct a more in-depth evaluation of ILP and CP’s capabilities to solve the sum colouring problem, with several improvements. Moreover, we propose to combine ILP and CP in a tree decomposition with a bounded height.
منابع مشابه
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem
The Sum Colouring Problem is an NP-hard problem derived from the well-known graph colouring problem. It consists in finding a proper colouring which minimizes the sum of the assigned colours rather than the number of those colours. This problem often arises in scheduling and resource allocation. In this paper, we conduct an in-depth evaluation of ILP and CP’s capabilities to solve this problem,...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملA Benders Decomposition Method to Solve an Integrated Logistics Network Designing Problem with Multiple Capacities
In this paper, a new model is proposed for the integrated logistics network designing problem. In many research papers in this area, it is assumed that there is only one option for the capacity of each facility in the network. However, this is not a realistic assumption because generally there may be many possible options for the capacity of the facility that is being established. Usually the c...
متن کاملA Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem
Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...
متن کاملAdversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of opponents, we can model both collaborative problem solving, where intelligent participants with different agendas must work together to solve a problem, and multi-criteria optimisation, where one decision maker must balance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017